A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
نویسندگان
چکیده
Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over {0, 1} without two consecutive 1. Given a set X of integers such that the language of their greedy representations in this system is accepted by a finite automaton, we consider the problem of deciding whether or not X is a finite union of arithmetic progressions. We obtain a decision procedure under some hypothesis about the considered numeration system. In a second part, we obtain an analogous decision result for a particular class of abstract numeration systems built on an infinite regular language.
منابع مشابه
Multi-dimensional sets recognizable in all abstract numeration systems
numeration systems An abstract numeration system is a triple S = (L,Σ, <) where L is an infinite regular language over the totally ordered alphabet (Σ, <) By enumerating words of L in the radix order (induced by <), we define a one-to-one correspondence between N and L repS : N → L : n 7→ (n + 1)th word of L valS = rep −1 S : L → N Abstract numeration systems Example S = (a∗b∗, {a, b}, a < b) L...
متن کاملReal numbers having ultimately periodic representations in abstract numeration systems
Using a genealogically ordered infinite regular language, we know how to represent an interval ofR. Numbers having an ultimately periodic representation play a special role in classical numeration systems. The aim of this paper is to characterize the numbers having an ultimately periodic representation in generalized systems built on a regular language. The syntactical properties of these words...
متن کاملCobham's theorem for substitutions
The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a complete and general version for the so-called substitutive sequences. Let α and β be two multiplicatively independent Perron numbers. Then, a sequence x ∈ A...
متن کاملA New Approach for Knowledge Based Systems Reduction using Rough Sets Theory (RESEARCH NOTE)
Problem of knowledge analysis for decision support system is the most difficult task of information systems. This paper presents a new approach based on notions of mathematical theory of Rough Sets to solve this problem. Using these concepts a systematic approach has been developed to reduce the size of decision database and extract reduced rules set from vague and uncertain data. The method ha...
متن کاملSyntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure
We compute the cardinality of the syntactic monoid of the language 0∗ repb(mN) made of base b expansions of the multiples of the integer m. We also give lower bounds for the syntactic complexity of any (ultimately) periodic set of integers written in base b. We apply our results to a well studied problem: decide whether or not a b-recognizable set of integers is ultimately periodic.
متن کامل